Fast connected-component labeling

نویسندگان

  • Lifeng He
  • Yuyan Chao
  • Kenji Suzuki
  • Kesheng Wu
چکیده

Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan

This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...

متن کامل

Efficient Connected Component Labeling on RISC Architectures

This article introduces two fast algorithms for Connected Component Labeling of binary images, a peculiar case of coloring. The first one, SelkowDT is pixel-based and a Selkow’s algorithm combined with the Decision Tree optimization technique. The second one called Light Speed Labeling is segment-based line-relative labeling and was especially thought for commodity RISC architectures. An extens...

متن کامل

Linear-time connected-component labeling based on sequential local operations

This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...

متن کامل

Fast Parallel Connected Component Labeling Algorithms Using Cuda Based on 8-directional Label Selection

Connected component labeling (CCL) is a key step in image segmentation where foreground pixels are extracted and labeled. Sequential CCL is a computationally expensive operation and thus is often done within parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them NSZ label equivalence (NSZ-LE) method seemed to perform...

متن کامل

A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question whether there exists an O(n)–time and O(log n)–space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack–like data structures to achieve the lower bound o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2009